#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL p=1e5+10;
LL n,a[p],ans;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)
          scanf("%lld",&a[i]);
    sort(a+1,a+1+n);
    LL ip=1;
    for(int i=1;i<=n;i++)
        if(a[i]>a[ip])
        {
            ans++;
            ip++;
        }
    printf("%lld\n",n-ans);
    return 0;
}
